Ela Zero-nonzero Patterns for Nilpotent Matrices Over

نویسندگان

  • FINITE FIELDS
  • KEVIN N. VANDER MEULEN
  • ADAM VAN TUYL
چکیده

Fix a field F. A zero-nonzero pattern A is said to be potentially nilpotent over F if there exists a matrix with entries in F with zero-nonzero pattern A that allows nilpotence. In this paper an investigation is initiated into which zero-nonzero patterns are potentially nilpotent over F with a special emphasis on the case that F = Zp is a finite field. A necessary condition on F is observed for a pattern to be potentially nilpotent when the associated digraph has m loops but no small k-cycles, 2 ≤ k ≤ m − 1. As part of this investigation, methods are developed, using the tools of algebraic geometry and commutative algebra, to eliminate zero-nonzero patterns A as being potentially nilpotent over any field F. These techniques are then used to classify all irreducible zero-nonzero patterns of order two and three that are potentially nilpotent over Zp for each prime p.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Zero-nonzero Patterns for Nilpotent Matrices over Finite Fields

Abstract. Fix a field F. A zero-nonzero pattern A is said to be potentially nilpotent over F if there exists a matrix with entries in F with zero-nonzero pattern A that allows nilpotence. In this paper we initiate an investigation into which zero-nonzero patterns are potentially nilpotent over F, with a special emphasis on the case that F = Zp is a finite field. As part of this investigation, w...

متن کامل

Structure of nilpotent matrices over fields

A zero-nonzero pattern A is said to be potentially nilpotent over a field F if there exists a nilpotent matrix with entries in F having zero-nonzero pattern A. We explore the construction of potentially nilpotent patterns over a field. We present classes of patterns which are potentially nilpotent over a field F if and only if the field F contains certain roots of unity. We then introduce some ...

متن کامل

Ela Allow Problems concerning Spectral Properties of Patterns∗

Let S ⊆ {0,+,−,+0,−0, ∗,#} be a set of symbols, where + (resp., −, +0 and −0) denotes a positive (resp., negative, nonnegative and nonpositive) real number, and ∗ (resp., #) denotes a nonzero (resp., arbitrary) real number. An S-pattern is a matrix with entries in S. In particular, a {0,+,−}-pattern is a sign pattern and a {0, ∗}-pattern is a zero-nonzero pattern. This paper extends the followi...

متن کامل

Ela on the Minimum Rank of Not Necessarily Symmetric Matrices: a Preliminary Study∗

The minimum rank of a directed graph Γ is defined to be the smallest possible rank over all real matrices whose ijth entry is nonzero whenever (i, j) is an arc in Γ and is zero otherwise. The symmetric minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i = j) is nonzero whenever {i, j} is an edge in G and is zero o...

متن کامل

Ela Generating Potentially

A sign pattern is a matrix with entries in {+, −, 0}. A full sign pattern has no zero entries. The refined inertia of a matrix pattern is defined and techniques are developed for constructing potentially nilpotent full sign patterns. Such patterns are spectrally arbitrary. These techniques can also be used to construct potentially nilpotent sign patterns that are not full, as well as potentiall...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009